Dynamic Distributed Scheduling in Random Access Networks
نویسندگان
چکیده
منابع مشابه
Dynamic Distributed Scheduling in Random Access Networks
We consider a model of random access (slotted-aloha-type) communication networks of general topology. Assuming that network links receive exogenous arrivals of packets for transmission, we seek dynamic distributed random access strategies whose goal is to keep all network queues stable. We prove that two dynamic strategies, which we collectively call queue length based random access (QRA), ensu...
متن کاملDistributed dynamic channel access scheduling for ad hoc networks
Three types of collision-free channel access protocols for ad hoc networks are presented. These protocols are derived from a novel approach to contention resolution that allows contending entities to elect one or multiple winners for channel access in any given contention context (e.g., a time slot) in a distributed fashion. In multihop wireless networks, the only required information for each ...
متن کاملDistributed Random Access Algorithm: Scheduling and Congesion Control
This paper provides proofs of the rate stability, Harris recurrence, and -optimality of carrier sense multiple access (CSMA) algorithms where the random access (or backoff) parameter of each node is adjusted dynamically. These algorithms require only local information and they are easy to implement. The setup is a network of wireless nodes with a fixed conflict graph that identifies pairs of no...
متن کاملDistributed Priority Scheduling and Medium Access in Ad Hoc Networks
Providing Quality-of-Service in random access multi-hop wireless networks requires support from both medium access and packet scheduling algorithms. However, due to the distributed nature of ad hoc networks, nodes may not be able to determine the next packet that would be transmitted in a (hypothetical) centralized and ideal dynamic priority scheduler. In this paper, we develop two mechanisms f...
متن کاملA Distributed MAC Protocol for Cooperation in Random Access Networks
WLAN is one of the most successful applications of wireless communications in daily life because of low cost and ease of deployment. The enabling technique for this success is the use of random access schemes for the wireless channel. Random access requires minimal coordination between the nodes, which considerably reduces the cost of the infrastructure. Recently, cooperative communication in w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Probability
سال: 2008
ISSN: 0021-9002,1475-6072
DOI: 10.1239/jap/1214950349